Sorting Under Forbidden Comparisons
نویسندگان
چکیده
In this paper we study the problem of sorting under forbidden comparisons where some pairs of elements may not be compared (forbidden pairs). Along with the set of elements V the input to our problem is a graph G(V,E), whose edges represents the pairs that we can compare in constant time. Given a graph with n vertices and m = ( n 2 ) − q edges we propose the first nontrivial deterministic algorithm which makes O((q+n) logn) comparisons with a total complexity of O(n2 + qω/2), where ω is the exponent in the complexity of matrix multiplication. We also propose a simple randomized algorithm for the problem which makes Õ(n2/ √ q + n+n√q) probes with high probability. When the input graph is random we show that Õ(min (n3/2, pn2)) probes suffice, where p is the edge probability. 1998 ACM Subject Classification F.2.2 Sorting and searching
منابع مشابه
Sorting Under 1-$\infty$ Cost Model
In this paper we study the problem of sorting under nonuniform comparison costs, where costs are either 1 or ∞. If comparing a pair has an associated cost of ∞ then we say that such a pair cannot be compared (forbidden pairs). Along with the set of elements V (n = |V |) the input to our problem is a graph G(V,E), whose edges represents the pairs that we can compare incurring unit cost. We let E...
متن کاملSorting classes – Extended Abstract
Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permut...
متن کاملSorting Classes
Weak and strong sorting classes are pattern-closed classes that are also closed downwards under the weak and strong orders on permutations. They are studied using partial orders that capture both the subpermutation order and the weak or strong order. In both cases they can be characterised by forbidden permutations in the appropriate order. The connection with the corresponding forbidden permut...
متن کاملTwo classic sorting algorithms: mergesort and quicksort
The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm -PICK. Specifically, no more than 5.4305 n comparisons are ever required. This bound is improved for extreme values of i , and a new lower bound on the requisite number of comparisons is also proved. This work was supported by the Nat...
متن کاملSorting Permutations on Two Parallel Stacks
We give a new combinatorial proof, based on stack graphs, for the characterization by forbidden subsequences of the permutations which are sortable on two parallel stacks. Some remarks about the permutations sortable on parallel queues are also made.
متن کامل